Is Dial-a-Ride Bus Reasonable in Large Scale Towns? Evaluation of Usability of Dial-a-Ride Systems by Simulation
نویسندگان
چکیده
Dial-a-ride systems are focused as a style of new transportation systems for urban area. While it is reported that such systems improve usability of bus systems when it is applied in a small town/area, it is not obvious how and when the system are reasonable compared with traditional fixed-route bus systems. We conducted a couple of computer simulations of dial-a-ride and fixed-route systems to compare usability and profitability of both systems. The result of the simulations says: (1) Usability of the dial-a-ride system with a fixed number of buses drops very quickly when the number of demands increases. (2) When we increase the number of buses proportionally to the number of demands, the usability of the dial-a-ride system is improved more significantly than the fixed-route system. (3) When frequency of demands is large enough, the diala-ride system is a reasonable solution from both viewpoints of usability and profitability.
منابع مشابه
Evaluation of Usability of Dial-a-Ride Systems by Social Simulation
Dial-a-ride systems attract great attentions as a style of new transportation systems for urban areas. While it is reported that such systems improve usability of bus systems when applied in a small town or area, it is not obvious how and under what conditions the system are reasonable in comparison to traditional fixed-route bus systems. We conducted several computer simulations of dial-a-ride...
متن کاملEvaluation of Usability of Dial-a-Ride Systems by Social Simulation
Dial-a-ride systems attract great attentions as a style of new transportation systems for urban areas. While it is reported that such systems improve usability of bus systems when applied in a small town or area, it is not obvious how and under what conditions the system are reasonable in comparison to traditional fixed-route bus systems. We conducted several computer simulations of dial-a-ride...
متن کاملHeuristics and Performance Metamodels for the Dynamic Dial-a-Ride Problem
Title of dissertation: HEURISTICS AND PERFORMANCE METAMODELS FOR THE DYNAMIC DIAL-A-RIDE PROBLEM Ying Luo, Doctor of Philosophy, 2006 Directed by: Professor Paul M. Schonfeld Department of Civil and Environmental Engineering Explicit performance models of a transit system are often very useful in facilitating system design, optimization, alternative comparison, and gaining insights into the sys...
متن کاملThe Online Dial-a-Ride Problem under Reasonable Load
In this paper, we analyze algorithms for the online dial-a-ride problem with request sets that fulfill a certain worst-case restriction: roughly speaking, a set of requests for the online dial-a-ride problem is reasonable if the requests that come up in a sufficiently large time period can be served in a time period of at most the same length. This new notion is a stability criterion implying t...
متن کاملar X iv : 0 70 7 . 06 48 v 1 [ cs . D S ] 4 J ul 2 00 7 Dial a Ride from k - forest
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × V and a “target” k ≤ m, the goal is to find a minimum cost subgraph that connects at least k demand pairs. In this paper, we give an O(min{√n, √ k})-approximation algorithm for k-forest, improving on the previous best rat...
متن کامل